Response letter of the first round of the review

The standard SPARQL query language is currently defined for querying RDF graphs without RDFS semantics. Sev-eral extensions to SPARQL have been proposed to query RDF graphs considering RDFS semantics. In this paper, we discussextensions of SPARQL that uses regular expressions to navigate RDF graphs and may be used to answer queries consideringRDFS semantics. In particular, we present and compare nSPARQL and our proposal CPSPARQL. We show that CPSPARQL isexpressive enough to answer full SPARQL queries modulo RDFS. Finally, we compare the expressiveness and complexity ofboth nSPARQL and the corresponding fragment of CPSPARQL, that we call cpSPARQL. We show that both languages have thesame complexity through cpSPARQL, being a proper extension of SPARQL graph patterns, is more expressive than nSPARQL.